Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(X,g(X)) |
→ f(1,g(X)) |
| 2: |
|
g(1) |
→ g(0) |
|
There are 2 dependency pairs:
|
| 3: |
|
F(X,g(X)) |
→ F(1,g(X)) |
| 4: |
|
G(1) |
→ G(0) |
|
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The usable rules are {2}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006